The while Macro Instructions of SCMFSA. Part II
نویسنده
چکیده
An attempt to use the while macro, [14], was the origin of writing this article. The while semantics, as given by J.-C. Chen, is slightly extended by weakening its correctness conditions and this forced a quite straightforward remake of a number of theorems from [14]. Numerous additional properties of the while macro are then proven. In the last section, we define a macro instruction computing the fusc function (see the SCM program computing the same function in [10]) and prove its correctness.
منابع مشابه
Initialization Halting Concepts and Their Basic Properties of SCMFSA
Up to now, many properties of macro instructions of SCMFSA are described by the parahalting concepts. However, many practical programs are not always halting while they are halting for initialization states. For this reason, we propose initialization halting concepts. That a program is initialization halting (called ”InitHalting” for short) means it is halting for initialization states.In order...
متن کاملWhile Macro Instructions of SCMFSA
(1) For every macro instruction I and for every integer location a holds card(if a = 0 then I; Goto(insloc(0)) else (StopSCMFSA)) = card I +6. (2) For every macro instruction I and for every integer location a holds card(if a > 0 then I; Goto(insloc(0)) else (StopSCMFSA)) = card I +6. Let a be an integer location and let I be a macro instruction. The functor while a = 0 do I yields a macro inst...
متن کاملMemory Handling for SCMFSA
We introduce some terminology for reasoning about memory used in programs in general and in macro instructions (introduced in [23]) in particular. The usage of integer locations and of finite sequence locations by a program is treated separately. We define some functors for selecting memory locations needed for local (temporary) variables in macro instructions. Some semantic properties of the i...
متن کاملOn the Composition of Non-parahalting Macro Instructions
An attempt to use the Times macro, [2], was the origin of writing this article. First, the semantics of the macro composition as developed in [23, 3, 4] is extended to the case of macro instructions which are not always halting. Next, several functors extending the memory handling for SCMFSA, [18], are defined; they are convenient when writing more complicated programs. After this preparatory w...
متن کاملBubble Sort on SCMFSA
We present the bubble sorting algorithm using macro instructions such as the if-Macro (conditional branch macro instructions) and the TimesMacro (for-loop macro instructions) etc. The correctness proof of the program should include the proof of autonomic, halting and the correctness of the program result. In the three terms, we justify rigorously the correctness of the bubble sorting algorithm....
متن کامل